<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/queue_algorithms/min_queue/minqueue_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('minqueue__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">minqueue_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="minqueue__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef MINQUEUE_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define MINQUEUE_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="minqueue_8h.html">minqueue.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">using</span> <a class="code" href="class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue.html">IntroductionToAlgorithm::QueueAlgorithm::MinQueue</a>;</div>
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html">   25</a></span>&#160;<span class="keyword">namespace  </span>{</div>
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">   26</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>=10;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;}</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="struct_node.html">   31</a></span>&#160;<span class="keyword">struct </span><a class="code" href="struct_node.html">Node</a></div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;{</div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="struct_node.html#a3c69606b98be4c0fe6cc2abbe554948e">   33</a></span>&#160;    <a class="code" href="struct_node.html#a3c69606b98be4c0fe6cc2abbe554948e">Node</a>(<span class="keywordtype">int</span> k):<a class="code" href="struct_node.html#afcabbedc2b739455060451607c6344e4">key</a>(k){}</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="struct_node.html#afcabbedc2b739455060451607c6344e4">   34</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="struct_node.html#afcabbedc2b739455060451607c6344e4">key</a>; </div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;};</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="class_min_queue_test.html">   42</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_min_queue_test.html">MinQueueTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;{</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a627ceae9e25205d70955137bbfc863fd">   45</a></span>&#160;    <span class="keyword">typedef</span> std::function&lt;bool (std::shared_ptr&lt;int&gt;,std::shared_ptr&lt;int&gt;)&gt; <a class="code" href="class_min_queue_test.html#a627ceae9e25205d70955137bbfc863fd">Int_Compare_Type</a> ; </div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a40648c6c5c338387bda62519dc99fc79">   46</a></span>&#160;    <span class="keyword">typedef</span> std::function&lt;int&amp;(std::shared_ptr&lt;int&gt;)&gt; <a class="code" href="class_min_queue_test.html#a40648c6c5c338387bda62519dc99fc79">Int_Get_Type</a>; </div>
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a25bfd5b74968c587db57133f107a5f61">   47</a></span>&#160;    <span class="keyword">typedef</span> std::function&lt;bool (std::shared_ptr&lt;Node&gt;,std::shared_ptr&lt;Node&gt;)&gt; <a class="code" href="class_min_queue_test.html#a25bfd5b74968c587db57133f107a5f61">Struct_Compare_Type</a> ;</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#aebcf6172ed7e9dd6f821fb1043f1cd6f">   48</a></span>&#160;    <span class="keyword">typedef</span> std::function&lt;double&amp;(std::shared_ptr&lt;Node&gt;)&gt; <a class="code" href="class_min_queue_test.html#aebcf6172ed7e9dd6f821fb1043f1cd6f">Struct_Get_Type</a>;</div>
<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a9b7e5e987d5e856adc5beb6986dd96a3">   49</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue.html">MinQueue&lt;Node,double&gt;</a> <a class="code" href="class_min_queue_test.html#a9b7e5e987d5e856adc5beb6986dd96a3">Struct_MinQueue_Type</a>;</div>
<div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#ad81df38acc845934accb320c4dbdd582">   50</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue.html">MinQueue&lt;int,int&gt;</a> <a class="code" href="class_min_queue_test.html#ad81df38acc845934accb320c4dbdd582">Int_MinQueue_Type</a>;</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#ae801d45bf78b7bb80b278264d3a8e96a">   52</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_min_queue_test.html#ae801d45bf78b7bb80b278264d3a8e96a">SetUp</a>()</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    {</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <a class="code" href="class_min_queue_test.html#a25bfd5b74968c587db57133f107a5f61">Struct_Compare_Type</a> node_compare=[](std::shared_ptr&lt;Node&gt; first,std::shared_ptr&lt;Node&gt; second){<span class="keywordflow">return</span> first-&gt;key&lt;second-&gt;key;};</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <a class="code" href="class_min_queue_test.html#aebcf6172ed7e9dd6f821fb1043f1cd6f">Struct_Get_Type</a> node_get=[](std::shared_ptr&lt;Node&gt; node)-&gt;<span class="keywordtype">double</span>&amp; {<span class="keywordflow">return</span> node-&gt;key;};</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <a class="code" href="class_min_queue_test.html#aed079eb9c6dd8460cc785b0fc6088a97">_strcut_minqueue</a>=std::make_shared&lt;Struct_MinQueue_Type&gt;(node_compare,node_get);</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <a class="code" href="class_min_queue_test.html#a627ceae9e25205d70955137bbfc863fd">Int_Compare_Type</a> int_compare=[](std::shared_ptr&lt;int&gt; first,std::shared_ptr&lt;int&gt;second){<span class="keywordflow">return</span> *first&lt;*second;};</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <a class="code" href="class_min_queue_test.html#a40648c6c5c338387bda62519dc99fc79">Int_Get_Type</a> int_get=[](std::shared_ptr&lt;int&gt; node)-&gt;<span class="keywordtype">int</span>&amp;{<span class="keywordflow">return</span> *node;};</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <a class="code" href="class_min_queue_test.html#a03f9ea0fcc4b820a539d32d6539c2df9">_int_minqueue</a>=std::make_shared&lt;Int_MinQueue_Type&gt;(int_compare,int_get);</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    }</div>
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a3e949d54ecada54f713ff47d80eb513c">   62</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_min_queue_test.html#a3e949d54ecada54f713ff47d80eb513c">TearDown</a>(){}</div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#aed079eb9c6dd8460cc785b0fc6088a97">   63</a></span>&#160;    std::shared_ptr&lt;Struct_MinQueue_Type&gt; <a class="code" href="class_min_queue_test.html#aed079eb9c6dd8460cc785b0fc6088a97">_strcut_minqueue</a>;    </div>
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="class_min_queue_test.html#a03f9ea0fcc4b820a539d32d6539c2df9">   64</a></span>&#160;    std::shared_ptr&lt;Int_MinQueue_Type&gt; <a class="code" href="class_min_queue_test.html#a03f9ea0fcc4b820a539d32d6539c2df9">_int_minqueue</a>;    </div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;};</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">   72</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_min)</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;{</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    EXPECT_FALSE(_strcut_minqueue-&gt;min());</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    EXPECT_FALSE(_int_minqueue-&gt;min());</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;}</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#a23b427e2a4b19b649fe2470df53d129b">   82</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_extract_min)</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;{</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;    EXPECT_FALSE(_strcut_minqueue-&gt;min());</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    EXPECT_FALSE(_int_minqueue-&gt;min());</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;}</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#ad8f979c4a970d6da46dce5fc51ad9be0">   92</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_insert)</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;{</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>-1;i&gt;=0;i--)</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    {</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        _strcut_minqueue-&gt;insert(std::make_shared&lt;Node&gt;(i));</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        EXPECT_NEAR(_strcut_minqueue-&gt;min()-&gt;key,i,0.001)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    }</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    EXPECT_NEAR(_strcut_minqueue-&gt;min()-&gt;key,0,0.001);</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>;i++)</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    {</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;       EXPECT_NEAR(_strcut_minqueue-&gt;extract_min()-&gt;key,i,0.001)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    }</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=Q_NUM-1;i&gt;=0;i--)</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    {</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        _int_minqueue-&gt;insert(std::make_shared&lt;int&gt;(i));</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        EXPECT_EQ(*(_int_minqueue-&gt;min()),i)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    }</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    EXPECT_EQ(*(_int_minqueue-&gt;min()),0);</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>;i++)</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    {</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;       EXPECT_EQ(*(_int_minqueue-&gt;extract_min()),i)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    }</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div>
<div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#abb112e00f9190db01bd4a0f1b5b0a614">  121</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_is_empty)</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;{</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    EXPECT_TRUE(_strcut_minqueue-&gt;is_empty());</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    EXPECT_TRUE(_int_minqueue-&gt;is_empty());</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    _strcut_minqueue-&gt;insert(std::make_shared&lt;Node&gt;(0));</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    _int_minqueue-&gt;insert(std::make_shared&lt;int&gt;(0));</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    EXPECT_FALSE(_strcut_minqueue-&gt;is_empty());</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    EXPECT_FALSE(_int_minqueue-&gt;is_empty());</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;}</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div>
<div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#a0d1b31cc45a5c0bc93e1af85b15972bb">  135</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_index_inqueue)</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;{</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    std::shared_ptr&lt;Node&gt; nodes[<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>];</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    std::shared_ptr&lt;int&gt; ints[<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>];</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>;i++)</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    {</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        nodes[i]=std::make_shared&lt;Node&gt;(i);</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        ints[i]=std::make_shared&lt;int&gt;(i);</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    }</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>;i++)</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;    {</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        EXPECT_EQ(_strcut_minqueue-&gt;insert(nodes[i]),i-1);</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;        EXPECT_EQ(_int_minqueue-&gt;insert(ints[i]),i-1);</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    }</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    EXPECT_EQ(_strcut_minqueue-&gt;index_inqueue(nodes[0]),-1);</div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;    EXPECT_EQ(_int_minqueue-&gt;index_inqueue(ints[0]),-1);</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    EXPECT_THROW(_strcut_minqueue-&gt;index_inqueue(std::shared_ptr&lt;Node&gt;()),std::invalid_argument);</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    EXPECT_THROW(_int_minqueue-&gt;index_inqueue(std::shared_ptr&lt;int&gt;()),std::invalid_argument);</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;<a class="code" href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">Q_NUM</a>;i++)</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    {</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;        EXPECT_EQ(_strcut_minqueue-&gt;index_inqueue(nodes[i]),i-1)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;        EXPECT_EQ(_int_minqueue-&gt;index_inqueue(ints[i]),i-1)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    }</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;}</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div>
<div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#aef5f2ca4ac17ec851b45200adfeb46ec">  164</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_decreate_key)</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;{</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="comment">// test_insert测试通过，则test_decreate_key隐含着测试通过</span></div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;}</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div>
<div class="line"><a name="l00173"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#a06d0f0b537e5e33c402fd59bdc22a40e">  173</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_setupHeap)</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;{</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="comment">//该接口为遗留接口，因此这里不再测试</span></div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;}</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div>
<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="minqueue__test_8h.html#a90ff801f1417c5ee3336bb73ded2f7f2">  182</a></span>&#160;<a class="code" href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a>(<a class="code" href="class_min_queue_test.html">MinQueueTest</a>,test_heapify)</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;{</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="comment">// extract_min测试通过，则test_decreate_key隐含着测试通过</span></div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;}</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;<span class="preprocessor">#endif // MINQUEUE_TEST</span></div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;</div>
<div class="ttc" id="class_min_queue_test_html_a03f9ea0fcc4b820a539d32d6539c2df9"><div class="ttname"><a href="class_min_queue_test.html#a03f9ea0fcc4b820a539d32d6539c2df9">MinQueueTest::_int_minqueue</a></div><div class="ttdeci">std::shared_ptr&lt; Int_MinQueue_Type &gt; _int_minqueue</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00064">minqueue_test.h:64</a></div></div>
<div class="ttc" id="class_min_queue_test_html_a3e949d54ecada54f713ff47d80eb513c"><div class="ttname"><a href="class_min_queue_test.html#a3e949d54ecada54f713ff47d80eb513c">MinQueueTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00062">minqueue_test.h:62</a></div></div>
<div class="ttc" id="class_min_queue_test_html_a9b7e5e987d5e856adc5beb6986dd96a3"><div class="ttname"><a href="class_min_queue_test.html#a9b7e5e987d5e856adc5beb6986dd96a3">MinQueueTest::Struct_MinQueue_Type</a></div><div class="ttdeci">MinQueue&lt; Node, double &gt; Struct_MinQueue_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00049">minqueue_test.h:49</a></div></div>
<div class="ttc" id="class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue_html"><div class="ttname"><a href="class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue.html">IntroductionToAlgorithm::QueueAlgorithm::MinQueue</a></div><div class="ttdoc">MinQueue：最小优先级队列，算法导论第6章6.5节 </div><div class="ttdef"><b>Definition:</b> <a href="minqueue_8h_source.html#l00060">minqueue.h:60</a></div></div>
<div class="ttc" id="class_min_queue_test_html_a25bfd5b74968c587db57133f107a5f61"><div class="ttname"><a href="class_min_queue_test.html#a25bfd5b74968c587db57133f107a5f61">MinQueueTest::Struct_Compare_Type</a></div><div class="ttdeci">std::function&lt; bool(std::shared_ptr&lt; Node &gt;, std::shared_ptr&lt; Node &gt;)&gt; Struct_Compare_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00047">minqueue_test.h:47</a></div></div>
<div class="ttc" id="struct_node_html_afcabbedc2b739455060451607c6344e4"><div class="ttname"><a href="struct_node.html#afcabbedc2b739455060451607c6344e4">Node::key</a></div><div class="ttdeci">double key</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00034">minqueue_test.h:34</a></div></div>
<div class="ttc" id="minqueue_8h_html"><div class="ttname"><a href="minqueue_8h.html">minqueue.h</a></div></div>
<div class="ttc" id="class_min_queue_test_html"><div class="ttname"><a href="class_min_queue_test.html">MinQueueTest</a></div><div class="ttdoc">MinQueueTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00042">minqueue_test.h:42</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02minqueue__test_8h_03_html_abe2fd10b52615354013b4d2480133959"><div class="ttname"><a href="namespaceanonymous__namespace_02minqueue__test_8h_03.html#abe2fd10b52615354013b4d2480133959">anonymous_namespace{minqueue_test.h}::Q_NUM</a></div><div class="ttdeci">const int Q_NUM</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00026">minqueue_test.h:26</a></div></div>
<div class="ttc" id="class_min_queue_test_html_aebcf6172ed7e9dd6f821fb1043f1cd6f"><div class="ttname"><a href="class_min_queue_test.html#aebcf6172ed7e9dd6f821fb1043f1cd6f">MinQueueTest::Struct_Get_Type</a></div><div class="ttdeci">std::function&lt; double &amp;(std::shared_ptr&lt; Node &gt;)&gt; Struct_Get_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00048">minqueue_test.h:48</a></div></div>
<div class="ttc" id="struct_node_html_a3c69606b98be4c0fe6cc2abbe554948e"><div class="ttname"><a href="struct_node.html#a3c69606b98be4c0fe6cc2abbe554948e">Node::Node</a></div><div class="ttdeci">Node(int k)</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00033">minqueue_test.h:33</a></div></div>
<div class="ttc" id="class_min_queue_test_html_aed079eb9c6dd8460cc785b0fc6088a97"><div class="ttname"><a href="class_min_queue_test.html#aed079eb9c6dd8460cc785b0fc6088a97">MinQueueTest::_strcut_minqueue</a></div><div class="ttdeci">std::shared_ptr&lt; Struct_MinQueue_Type &gt; _strcut_minqueue</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00063">minqueue_test.h:63</a></div></div>
<div class="ttc" id="class_min_queue_test_html_a40648c6c5c338387bda62519dc99fc79"><div class="ttname"><a href="class_min_queue_test.html#a40648c6c5c338387bda62519dc99fc79">MinQueueTest::Int_Get_Type</a></div><div class="ttdeci">std::function&lt; int &amp;(std::shared_ptr&lt; int &gt;)&gt; Int_Get_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00046">minqueue_test.h:46</a></div></div>
<div class="ttc" id="minqueue__test_8h_html_a7d7e9ad0b2c53dda93300e9da2009fd0"><div class="ttname"><a href="minqueue__test_8h.html#a7d7e9ad0b2c53dda93300e9da2009fd0">TEST_F</a></div><div class="ttdeci">TEST_F(MinQueueTest, test_min)</div><div class="ttdoc">MinQueueTest:测试最小优先级队列 </div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00072">minqueue_test.h:72</a></div></div>
<div class="ttc" id="struct_node_html"><div class="ttname"><a href="struct_node.html">Node</a></div><div class="ttdoc">Node:用于测试的类型 </div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00031">minqueue_test.h:31</a></div></div>
<div class="ttc" id="class_min_queue_test_html_ad81df38acc845934accb320c4dbdd582"><div class="ttname"><a href="class_min_queue_test.html#ad81df38acc845934accb320c4dbdd582">MinQueueTest::Int_MinQueue_Type</a></div><div class="ttdeci">MinQueue&lt; int, int &gt; Int_MinQueue_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00050">minqueue_test.h:50</a></div></div>
<div class="ttc" id="class_min_queue_test_html_ae801d45bf78b7bb80b278264d3a8e96a"><div class="ttname"><a href="class_min_queue_test.html#ae801d45bf78b7bb80b278264d3a8e96a">MinQueueTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00052">minqueue_test.h:52</a></div></div>
<div class="ttc" id="class_min_queue_test_html_a627ceae9e25205d70955137bbfc863fd"><div class="ttname"><a href="class_min_queue_test.html#a627ceae9e25205d70955137bbfc863fd">MinQueueTest::Int_Compare_Type</a></div><div class="ttdeci">std::function&lt; bool(std::shared_ptr&lt; int &gt;, std::shared_ptr&lt; int &gt;)&gt; Int_Compare_Type</div><div class="ttdef"><b>Definition:</b> <a href="minqueue__test_8h_source.html#l00045">minqueue_test.h:45</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_b144fdcc7226fc970a6ccdd8bb1f9004.html">queue_algorithms</a></li><li class="navelem"><a class="el" href="dir_28335c281b58f87353fdbfb23e024a8a.html">min_queue</a></li><li class="navelem"><a class="el" href="minqueue__test_8h.html">minqueue_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
